Skip to main content

Show sorted alphabetically
SHOW DETAILS
up-solid down-solid
eye
Title
Date Reviewed
Review
ArsDigita Computer Science University
favoritefavoritefavoritefavoritefavorite Sep 28, 2010
movies
eye 86,248
favorite 16
comment 8
favoritefavoritefavoritefavoritefavorite

I am currently enrolled a graduate version of this class based on the same book (the whole book in...

A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course. Text: Introduction to the Theory of Computation, Michael Sipser....
Topic: computation

I am currently enrolled a graduate version of this class based on the same book (the whole book in...